Using Surrogate Information to Solve Multidimensional Multi-choice Knapsack Problem

OSC: solving the multidimensional multi-choice knapsack problem with tight strategic Oscillation using Surrogate Constraints

The multidimensional multi-choice knapsack problem (MMKP) is one of the most complex members of the Knapsack Problem (KP) family. It has been used to model large problems such as telecommunications, quality of service (QoS), management problem in computer networks and admission control problem in the adaptive multimedia systems. In this paper, we propose a new approach based on strategic oscill...

Development of core to solve the multidimensional multiple-choice knapsack problem

The multidimensional multiple-choice knapsack problem (MMKP) is an extension of the 0-1 knapsack problem. The core concept has been used to design efficient algorithms for the knapsack problem but the core has not been developed for the MMKP so far. In this paper, we develop an approximate core for the MMKP and utilize it to solve the problem exactly. Computational results show that the algorit...

A "reduce and solve" approach for the multiple-choice multidimensional knapsack problem

The multiple-choice multidimensional knapsack problem (MMKP) is a well-known NP-hard combinatorial optimization problem with a number of important applications. In this paper, we present a ”reduce and solve” heuristic approach which combines problem reduction techniques with an Integer Linear Programming (ILP) solver (CPLEX). The key ingredient of the proposed approach is a set of group fixing ...

Modified Choice Function Heuristic Selection for the Multidimensional Knapsack Problem

Hyper-heuristics are a class of high-level search methods used to solve computationally difficult problems, which operate on a search space of low-level heuristics rather than solutions directly. Previous work has shown that selection hyper-heuristics are able to solve many combinatorial optimisation problems, including the multidimensional 0-1 knapsack problem (MKP). The traditional framework ...

Heuristic algorithms for the multiple-choice multidimensional knapsack problem